Distributionally Robust Chance-Constrained Optimal Transmission Switching for Renewable Integration
نویسندگان
چکیده
Increasing integration of renewable generation poses significant challenges to ensure robustness guarantees in real-time energy system decision-making. This work aims develop a robust optimal transmission switching (OTS) framework that can effectively relieve grid congestion and mitigate curtailment. We formulate two-stage distributionally chance-constrained (DRCC) problem assures limited constraint violations for any uncertainty distribution within an ambiguity set. Here, the second-stage recourse variables are represented as linear functions uncertainty, yielding equivalent reformulation involving constraints only. utilize moment-based (mean-mean absolute deviation) distance-based ( $\infty$ -Wasserstein distance) sets lead scalable mixed-integer program (MILP) formulations. Numerical experiments on IEEE 14-bus 118-bus systems have demonstrated performance improvements proposed DRCC-OTS approaches terms guaranteed reduced In particular, computational efficiency MILP approach, which is scenario-free with fixed dimensions, has been confirmed, making it suitable operations.
منابع مشابه
Distributionally robust chance-constrained linear programs
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...
متن کاملOn Distributionally Robust Chance-Constrained Linear Programs1
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that, for a wide class of probability distributions (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...
متن کاملDistributionally Robust Chance-Constrained Bin Packing
Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...
متن کاملOn distributionally robust joint chance-constrained problems
Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...
متن کاملExistence of Nash equilibrium for distributionally robust chance-constrained games
We consider an n-player finite strategic game. The payoff vector of each player is a random vector whose distribution is not completely known. We assume that the distribution of the random payoff vector of each player belongs to a distributional uncertainty set. Using distributionally robust approach, we define a chance-constrained game with respect to the worst-case chanceconstraint. We call s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Sustainable Energy
سال: 2023
ISSN: ['1949-3029', '1949-3037']
DOI: https://doi.org/10.1109/tste.2022.3203669